Security Mediated Certificateless Signatures Without Pairing
نویسندگان
چکیده
Security-mediated certificateless (SMC) signature provides a method for immediate revocation of security capabilities in certificateless signature (CLS). In addition, SMC signauture maintains the merits in CLS: implicit certification without key escrow. Unfortunately, most of the existing schemes for CLS and SMC signature are based on bilinear pairing. There are schemes without bilinear pairing such as [1] and [2] which is based on discrete logarithm problem. In this paper, based on the schemes in [2] and [3], we propose another SMC signature scheme without bilinear pairing. Our scheme is existential unforgeable in the random oracle model based on the intractability of the factoring problem. In addition, it is also efficient in signing and verifying.
منابع مشابه
Efficient Certificateless Signatures Suitable for Aggregation
This technical report describes a novel certificateless signature scheme suitable for aggregation that requires no pairing computations for signing and only 3 pairing computations for signature verification. We provide proofs for the security of single and aggregate signatures.
متن کاملCryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practical identity based signcryption schemes without bilinear pairing are considered to be almost impossible, it will be interesting to explore possibilities of constructing such systems in other settings like certificateless cryptog...
متن کاملAn Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing
Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss [4] to provide delegation of decryption rights. PRE allows re-encryption of a ciphertext intended for Alice (delegator) to a ciphertext for Bob (delegatee) via a semi-honest proxy, who should not learn anything about the underlying message. In 2003, Al-Riyami and Patterson introduced the notion of ce...
متن کاملPairing-Free and Revocable Certificateless Signature Against Signing Key Exposure
Certificateless public key schemes without pairing have attracted much attention for its relatively high efficiency. The revocation problem is a very necessary issue in a public key cryptosystem. However, there have been some solutions to the certificateless revocation problem; they still suffer from low efficiency or security weakness. In this paper, we propose a revocable certificateless sign...
متن کاملReattack of a Certificateless Aggregate Signature Scheme with Constant Pairing Computations
A new attack against a novel certificateless aggregate signature scheme with constant pairing computations is presented. To enhance security, a new certificateless signature scheme is proposed first. Then a new certificateless aggregate signature scheme with constant pairing computations based on the new certificateless signature scheme is presented. Security analysis shows that the proposed ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 5 شماره
صفحات -
تاریخ انتشار 2010